VICKEY: Mining Conditional Keys on Knowledge Bases
نویسندگان
چکیده
A conditional key is a key constraint that is valid in only a part of the data. In this paper, we show how such keys can be mined automatically on large knowledge bases (KBs). For this, we combine techniques from key mining with techniques from rule mining. We show that our method can scale to KBs of millions of facts. We also show that the conditional keys we mine can improve the quality of entity linking by up to 47 percentage points.
منابع مشابه
Intelligent Approaches to Mining the Primary Research Literature: Techniques, Systems, and Examples
In this chapter, we describe how creating knowledge bases from the primary biomedical literature is formally equivalent to the process of performing a literature review or a ‘research synthesis’. We describe a principled approach to partitioning the research literature according to the different types of experiments performed by researchers and how knowledge engineering approaches must be caref...
متن کاملDefault reasoning from conditional knowledge bases: Complexity and tractable cases
Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form “ ! ”, which informally read as “generally, if then .” Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties ...
متن کاملNew Tractable Cases in Default Reasoning from Conditional Knowledge Bases
We present new tractable cases for default reasoning from conditional knowledge bases. In detail, we introduce q-Horn conditional knowledge bases, which allow for a limited use of disjunction. We show that previous tractability results for "-entailment, proper "-entailment, and zand z+-entailment in the Horn case can be extended to the q-Horn case. Moreover, we present feedback-freeHorn conditi...
متن کاملA Software System for the Computation, Visualization, and Comparison of Conditional Structures for Relational Probabilistic Knowledge Bases
Combining logic with probabilities is a core idea to uncertain reasoning. Recently, approaches to probabilistic conditional logics based on first-order languages have been proposed that employ the principle of maximum entropy (ME), e.g. the logic FO-PCL. In order to simplify the ME model computation, FO-PCL knowledge bases can be transformed so that they become parametrically uniform. On the ot...
متن کاملComplexity Results for Default Reasoning from Conditional Knowledge Bases
Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form “ ! ”, which informally read as “generally, if then .” Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017